4 research outputs found

    Complexity in Prefix-Free Regular Languages

    Full text link
    We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the tight bounds on state complexity of symmetric difference, and deterministic and nondeterministic state complexity of difference and cyclic shift of prefix-free languages.Comment: In Proceedings DCFS 2010, arXiv:1008.127

    Photoremovable Protecting Groups in Chemistry and Biology: Reaction Mechanisms and Efficacy

    No full text
    corecore